| contributor | IPVS, Verteilte Systeme |
| creator | Memon, Faraz |
| Tiebler, Daniel | |
| Dürr, Frank | |
| Rothermel, Kurt | |
| Tomsu, Marco | |
| Domschitz, Peter | |
| date | 2008 |
| description | In this paper, we present the system design and evaluation of a Space-Filling Curve (SFC)-based P2P information discovery system OID. The OID system uses multiple SFCs to significantly optimize the performance of multi-attribute range queries, particularly for applications with a large number of data attributes where a single big SFC-based index is inefficient. The basic idea is to have multiple SFCbased indices and select the best one to perform a query. We also introduce two tree-based query optimizations that increase the scalability of the system. |
| identifier | http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2008-83&engl=1 |
| ISBN: 978-0-7695-3434-3 | |
| language | eng |
| publisher | IEEE Computer Society |
| source | In: Proceedings of 14th International Conference on Parallel and Distributed Systems (ICPADS'08), pp. 311-319 |
| subject | Network Protocols (CR C.2.2) |
| Network Operations (CR C.2.3) | |
| Distributed Systems (CR C.2.4) | |
| title | OID: Optimized Information Discovery using Space Filling Curves in P2P Overlay Networks |
| type | Text |
| Article in Proceedings |